Approximation algorithm - PDFSEARCH.IO - Document Search Engine

Approximation algorithm
Results: 454

#	Item
391	A STABLE GEOMETRIC BUILDUP ALGORITHM FOR THE SOLUTION OF THE DISTANCE GEOMETRY PROBLEM USING LEAST-SQUARES By Atilla Sit Add to Reading List Source URL: ima.umn.edu Language: English - Date: 2011-10-06 10:33:09 Least squares Mathematics Distance Matrix Economics Sparse approximation Constraint algorithm Mathematical optimization Regression analysis Statistics
392	An Approximation of the Universal Intelligence Measure Shane Legg and Joel Veness November 2011 Add to Reading List Source URL: www.vetta.org Language: English - Date: 2011-11-16 08:45:57 Applied mathematics Turing machine Theory of computation Alan Turing Kolmogorov complexity Ray Solomonoff Algorithm Turing completeness Computability Theoretical computer science Computer science Computability theory
393	Package ‘TSP’ September 6, 2013 Type Package Title Traveling Salesperson Problem (TSP) Version[removed]Date[removed] Add to Reading List Source URL: cran.r-project.org Language: English - Date: 2013-09-06 14:45:51 Applied mathematics NP-complete problems Operations research Combinatorial optimization Approximation algorithms Concorde TSP Solver Nearest neighbour algorithm Lin–Kernighan heuristic Concorde Theoretical computer science Mathematics Travelling salesman problem
394	Better Guarantees for Sparsest Cut Clustering Maria-Florina Balcan Microsoft Research, New England One Memorial Drive, Cambridge, MA [removed] Add to Reading List Source URL: www.cs.cmu.edu Language: English - Date: 2009-05-22 14:29:08 Computational statistics Cut Graph connectivity K-means clustering K-medians clustering Approximation algorithm Linear programming relaxation K-means++ Cluster analysis Statistics Mathematics Combinatorial optimization
395	Approximability of Constraint Satisfaction Problems Venkatesan Guruswami Carnegie Mellon University October 2009 Add to Reading List Source URL: www.cs.cmu.edu Language: English - Date: 2009-11-30 17:57:22 Constraint satisfaction problem Mathematics Computational complexity theory Mathematical optimization Probabilistic complexity theory Constraint satisfaction Combinatorial optimization Approximation algorithm Probabilistically checkable proof Theoretical computer science Constraint programming Applied mathematics
396	Distrib. Comput[removed]: 303–310 Digital Object Identiﬁer (DOI[removed]s00446[removed]Constant-time distributed dominating set approximation Fabian Kuhn, Roger Wattenhofer Computer Engineering and Networks La Add to Reading List Source URL: distcomp.ethz.ch Language: English - Date: 2005-11-03 04:38:57 NP-complete problems Dominating set Algorithm Randomized rounding Connected dominating set Mathematics Theoretical computer science Applied mathematics
397	Every 2-CSP allows nontrivial approximation Johan H˚ astad Royal Institute of Technology Add to Reading List Source URL: www.nada.kth.se Language: English - Date: 2005-06-22 08:43:27 Constraint programming Computational complexity theory Constraint satisfaction problem 2-satisfiability Constraint satisfaction Approximation algorithm Logic in computer science Combinatorial optimization Linear programming Theoretical computer science Applied mathematics Mathematics
398	Speeding up Approximation with nicer Concepts Anni-Yasmin Turhan? and Yusri Bong Theoretical Computer Science, TU Dresden, Germany {turhan, bong}@tcs.inf.tu-dresden.de Abstract. Concept approximation is an inference serv Add to Reading List Source URL: www.ceur-ws.org Language: English - Date: 2007-05-22 01:39:22 Information science Non-classical logic Approximation algorithm Logarithm Concepts Anti de Sitter space Science Logic Mathematics Artificial intelligence Description logic
399	CSPs Classical results Semi-Definite programming Inapproximability results Classification Final words Add to Reading List Source URL: www.nada.kth.se Language: English - Date: 2007-09-24 02:56:24 NP-complete problems Combinatorial optimization Operations research Cut Graph connectivity Maximum cut Approximation algorithm Semidefinite programming Boolean satisfiability problem Theoretical computer science Mathematics Applied mathematics
400	CSPs Classical results Semi-Definite programming Inapproximability results Classification Unique games Add to Reading List Source URL: www.nada.kth.se Language: English - Date: 2007-09-24 02:48:52 NP-complete problems Combinatorial optimization Operations research Cut Graph connectivity Maximum cut Approximation algorithm Semidefinite programming 2-satisfiability Theoretical computer science Computational complexity theory Mathematics

UPDATE